0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n016.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 14:15:53 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.37	% Number of cores: 8
0.14/0.37	% Python version: Python 3.6.8
0.14/0.37	# Version: 2.6rc1-ho
0.14/0.38	# No SInE strategy applied
0.14/0.38	# Trying AutoSched0 for 59 seconds
0.55/0.76	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.55/0.76	# and selection function SelectMaxLComplexAvoidPosPred.
0.55/0.76	#
0.55/0.76	# Preprocessing time       : 0.108 s
0.55/0.76	
0.55/0.76	# Proof found!
0.55/0.76	# SZS status Theorem
0.55/0.76	# SZS output start CNFRefutation
0.55/0.76	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.55/0.76	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.55/0.76	thf(def_n_is, axiom, (n_is)=(^[X530:$i, X531:$i]:(X530)=(X531)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.55/0.76	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.55/0.76	thf(satz20e, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X264:$i]:in @ X264 @ nat) @ (^[X265:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:(n_is @ X1 @ X265<=n_is @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X265))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz20e)).
0.55/0.76	thf(satz6, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X227:$i]:in @ X227 @ nat) @ (^[X228:$i]:n_is @ (n_pl @ X1 @ X228) @ (n_pl @ X228 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz6)).
0.55/0.76	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.55/0.76	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.55/0.76	thf(def_nis, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_nis)).
0.55/0.76	thf(satz8, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X229:$i]:in @ X229 @ nat) @ (^[X230:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:(nis @ (n_pl @ X1 @ X230) @ (n_pl @ X1 @ X4)<=nis @ X230 @ X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz8)).
0.55/0.76	thf(c_0_10, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.55/0.76	thf(c_0_11, axiom, (n_is)=(^[X530:$i, X531:$i]:(X530)=(X531)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.55/0.76	thf(c_0_12, negated_conjecture, ~(![X1605:$i]:(in @ X1605 @ nat=>![X1610:$i]:(in @ X1610 @ nat=>![X1611:$i]:(in @ X1611 @ nat=>((n_pl @ X1611 @ X1605)=(n_pl @ X1611 @ X1610)=>(X1605)=(X1610)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz20e]), c_0_10]), c_0_11])])).
0.55/0.76	thf(c_0_13, plain, ![X1192:$i]:(in @ X1192 @ nat=>![X1196:$i]:(in @ X1196 @ nat=>(n_pl @ X1192 @ X1196)=(n_pl @ X1196 @ X1192))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz6, c_0_10]), c_0_11])).
0.55/0.76	thf(c_0_14, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.55/0.76	thf(c_0_15, negated_conjecture, (in @ esk68_0 @ nat&(in @ esk69_0 @ nat&(in @ esk70_0 @ nat&((n_pl @ esk70_0 @ esk68_0)=(n_pl @ esk70_0 @ esk69_0)&(esk68_0)!=(esk69_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
0.55/0.76	thf(c_0_16, plain, ![X2510:$i, X2511:$i]:(~in @ X2510 @ nat|(~in @ X2511 @ nat|(n_pl @ X2510 @ X2511)=(n_pl @ X2511 @ X2510))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.55/0.76	thf(c_0_17, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_nis, c_0_14]), c_0_11])).
0.55/0.76	thf(c_0_18, negated_conjecture, (n_pl @ esk70_0 @ esk68_0)=(n_pl @ esk70_0 @ esk69_0), inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.76	thf(c_0_19, plain, ![X1:$i, X4:$i]:((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_16])).
0.55/0.76	thf(c_0_20, negated_conjecture, in @ esk70_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.76	thf(c_0_21, negated_conjecture, in @ esk69_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.76	thf(c_0_22, plain, ![X1203:$i]:(in @ X1203 @ nat=>![X1208:$i]:(in @ X1208 @ nat=>![X1209:$i]:(in @ X1209 @ nat=>((X1208)!=(X1209)=>(n_pl @ X1203 @ X1208)!=(n_pl @ X1203 @ X1209))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz8, c_0_10]), c_0_17])])).
0.55/0.76	thf(c_0_23, negated_conjecture, (n_pl @ esk70_0 @ esk68_0)=(n_pl @ esk69_0 @ esk70_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])])).
0.55/0.76	thf(c_0_24, negated_conjecture, in @ esk68_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.76	thf(c_0_25, plain, ![X2512:$i, X2513:$i, X2514:$i]:(~in @ X2512 @ nat|(~in @ X2513 @ nat|(~in @ X2514 @ nat|((X2513)=(X2514)|(n_pl @ X2512 @ X2513)!=(n_pl @ X2512 @ X2514))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
0.55/0.76	thf(c_0_26, negated_conjecture, (n_pl @ esk70_0 @ esk69_0)=(n_pl @ esk69_0 @ esk70_0), inference(rw,[status(thm)],[c_0_18, c_0_23])).
0.55/0.76	thf(c_0_27, negated_conjecture, (n_pl @ esk69_0 @ esk70_0)=(n_pl @ esk68_0 @ esk70_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_23]), c_0_24]), c_0_20])])).
0.55/0.76	thf(c_0_28, plain, ![X1:$i, X4:$i, X5:$i]:((X4)=(X5)|~in @ X1 @ nat|~in @ X4 @ nat|~in @ X5 @ nat|(n_pl @ X1 @ X4)!=(n_pl @ X1 @ X5)), inference(split_conjunct,[status(thm)],[c_0_25])).
0.55/0.76	thf(c_0_29, negated_conjecture, (n_pl @ esk70_0 @ esk69_0)=(n_pl @ esk68_0 @ esk70_0), inference(rw,[status(thm)],[c_0_26, c_0_27])).
0.55/0.76	thf(c_0_30, negated_conjecture, ![X1:$i]:((esk69_0)=(X1)|(n_pl @ esk70_0 @ X1)!=(n_pl @ esk68_0 @ esk70_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_21]), c_0_20])])).
0.55/0.76	thf(c_0_31, negated_conjecture, (n_pl @ esk70_0 @ esk68_0)=(n_pl @ esk68_0 @ esk70_0), inference(rw,[status(thm)],[c_0_23, c_0_27])).
0.55/0.76	thf(c_0_32, negated_conjecture, (esk68_0)!=(esk69_0), inference(split_conjunct,[status(thm)],[c_0_15])).
0.55/0.76	thf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_24])]), c_0_32]), ['proof']).
0.55/0.76	# SZS output end CNFRefutation
0.55/0.76	# Proof object total steps             : 34
0.55/0.76	# Proof object clause steps            : 14
0.55/0.76	# Proof object formula steps           : 20
0.55/0.76	# Proof object conjectures             : 15
0.55/0.76	# Proof object clause conjectures      : 12
0.55/0.76	# Proof object formula conjectures     : 3
0.55/0.76	# Proof object initial clauses used    : 7
0.55/0.76	# Proof object initial formulas used   : 10
0.55/0.76	# Proof object generating inferences   : 4
0.55/0.76	# Proof object simplifying inferences  : 15
0.55/0.76	# Training examples: 0 positive, 0 negative
0.55/0.76	# Parsed axioms                        : 387
0.55/0.76	# Removed by relevancy pruning/SinE    : 0
0.55/0.76	# Initial clauses                      : 585
0.55/0.76	# Removed in clause preprocessing      : 165
0.55/0.76	# Initial clauses in saturation        : 420
0.55/0.76	# Processed clauses                    : 802
0.55/0.76	# ...of these trivial                  : 10
0.55/0.76	# ...subsumed                          : 152
0.55/0.76	# ...remaining for further processing  : 640
0.55/0.76	# Other redundant clauses eliminated   : 1105
0.55/0.76	# Clauses deleted for lack of memory   : 0
0.55/0.76	# Backward-subsumed                    : 0
0.55/0.76	# Backward-rewritten                   : 29
0.55/0.76	# Generated clauses                    : 11249
0.55/0.76	# ...of the previous two non-trivial   : 9907
0.55/0.76	# Contextual simplify-reflections      : 6
0.55/0.76	# Paramodulations                      : 9840
0.55/0.76	# Factorizations                       : 0
0.55/0.76	# NegExts                              : 11
0.55/0.76	# Equation resolutions                 : 1169
0.55/0.76	# Propositional unsat checks           : 0
0.55/0.76	#    Propositional check models        : 0
0.55/0.76	#    Propositional check unsatisfiable : 0
0.55/0.76	#    Propositional clauses             : 0
0.55/0.76	#    Propositional clauses after purity: 0
0.55/0.76	#    Propositional unsat core size     : 0
0.55/0.76	#    Propositional preprocessing time  : 0.000
0.55/0.76	#    Propositional encoding time       : 0.000
0.55/0.76	#    Propositional solver time         : 0.000
0.55/0.76	#    Success case prop preproc time    : 0.000
0.55/0.76	#    Success case prop encoding time   : 0.000
0.55/0.76	#    Success case prop solver time     : 0.000
0.55/0.76	# Current number of processed clauses  : 570
0.55/0.76	#    Positive orientable unit clauses  : 105
0.55/0.76	#    Positive unorientable unit clauses: 3
0.55/0.76	#    Negative unit clauses             : 63
0.55/0.76	#    Non-unit-clauses                  : 399
0.55/0.76	# Current number of unprocessed clauses: 9478
0.55/0.76	# ...number of literals in the above   : 46813
0.55/0.76	# Current number of archived formulas  : 0
0.55/0.76	# Current number of archived clauses   : 31
0.55/0.76	# Clause-clause subsumption calls (NU) : 49106
0.55/0.76	# Rec. Clause-clause subsumption calls : 9262
0.55/0.76	# Non-unit clause-clause subsumptions  : 101
0.55/0.76	# Unit Clause-clause subsumption calls : 11401
0.55/0.76	# Rewrite failures with RHS unbound    : 2
0.55/0.76	# BW rewrite match attempts            : 50
0.55/0.76	# BW rewrite match successes           : 8
0.55/0.76	# Condensation attempts                : 0
0.55/0.76	# Condensation successes               : 0
0.55/0.76	# Termbank termtop insertions          : 277211
0.55/0.76	
0.55/0.76	# -------------------------------------------------
0.55/0.76	# User time                : 0.379 s
0.55/0.76	# System time              : 0.017 s
0.55/0.76	# Total time               : 0.396 s
0.55/0.76	# Maximum resident set size: 2280 pages
0.55/0.76	EOF